Terabit per second ATM packet switch having distributed out-of-band control

ABSTRACT

An out-of-band controller for a large packet switch which is distributed throughout partitions or pipes of the packet switch. Thus, the out-of-band controller is divided into multiple pipe controllers. These pipe controllers are connected and operated in a ring such that each pipe controller is with a respective fraction of the input path requests for packets. The requests are processed concurrently and any request that is not fulfilled in one pipe controller is offered to up to three subsequent pipe controllers to hunt a path for the awaiting packets. The controller, by using up to four levels of parallelism, can hunt paths and set up connections for 256 or more input ATM packet lines, thus providing a throughput of 1 terabit per second or more. By distributing the controller both tremendous aggregate switching speeds may be attained without resort to exotic semiconductor technologies.

CROSS REFERENCES

This application is related to the following applications: "Terabit Per Second Packet Switch", Thomas Jay Cloonan and Gaylord Warner Richards, Filing Date Dec. 30, 1994, and Ser. No. 08/366,704, now U.S. Pat. No. 5,544,160; "Terabit Per Second ATM Packet Switch Having Distributed Out-Of-Band Control", Thomas Jay Cloonan and Gaylord Warner Richards, Filing Date Dec. 30, 1994, and Ser. No. 08/367,489; "Terabit Per Second Distribution Network", Thomas Jay Cloonan and Gaylord Warner Richards, Filing Date Dec. 30, 1994, and Ser. No. 08/366,707; "Terabit Per Second Packet Switch Having Distributed Out-Of-Band Control of Circuit and Packet Switching Communications", Thomas Jay Cloonan and Gaylord Warner Richards, Filing Date Dec. 30, 1994, and Ser. No. 08/366,708, now U.S. Pat. No. 5,537,403; "Method And Apparatus For Detecting And Preventing The Communication of Bit Errors On A High Performance Serial Data Link", Thomas Jay Cloonan and Gaylord Warner Richards, Filing Date Dec. 30, 1994, and Ser. No. 08/366,706, now U.S. Pat. No. 5,566,143; "Improved Bandwidth Efficiency mBnB Coding And Decoding Method And Apparatus", Thomas Jay Cloonan and Gaylord Warner Richards, Filing Date Dec. 9, 1994, and Ser. No. 08/353,410; "A Terabit Per Second Packet Switch Having Assignable Multiple Packet Loss Probabilities", Thomas Jay Cloonan and Gaylord Warner Richards, Filing Date Aug. 31, 1995, and Ser. No. 08/522,209; and "Terabit Per Second ATM Packet Switch Having Out-Of-Band Control With Multicasting", Thomas Jay Cloonan and Gaylord Warner Richards, Filing Date Aug. 31, 1995, and Ser. No. 08/521,676.

1. Technical Field

The invention relates to large telecommunication switches and more particularly to large telecommunication switches that use data packets in order to communicate at aggregate throughputs of one terabit per second which have distributed, out-of-band control.

2. Description of the Prior Art

Telecommunications have long used digital switching to encode, multiplex, transmit and decode audio frequencies in order to carry the millions of telephone voice calls of the world. Telecommunication switches for voice calls have grown to very large sizes to keep pace with the demand. Most of the switching systems that route and control voice call traffic are called circuit switches, which means that for each call a type of bi-directional audio circuit is set up between the calling party and the called party. The circuit that is set up has the bandwidth and transport timing necessary to simulate a face-to-face conversation without objectionable distortion or time delays.

An alternative to circuit switching is called packet switching. For packet switching, the calling party is responsible for converting the information into one or more packets. This information could be encoded voice, it could be encoded computer data, or it could be encoded video. The number of the called party is typically included in a packet header to guide the packet to its destination. The packet switching network has the task of routing each packet to its respective destination without undue delay. The called party usually has the equipment to receive the packets and decode the information back into an appropriate form.

The extremely rapid growth of packet switching traffic carrying voice, computer (LAN/WAN), facsimile, image and video data to an ever widening variety of locations, along with the proposals for a National Information Infrastructure, has challenged both the packet switch protocols and system architectures.

Many vendors and service providers have joined forces to define a global standard that would permit packet switching services to be provided in a ubiquitous fashion. The result of this coordinated effort has been the rapid development and deployment of an Asynchronous Transfer Mode (ATM) as a means of efficiently routing and transporting data packets that have stochastically-distributed arrival rates according to the recent ATM standard. ATM is thus a packet-oriented standard, but unlike most of its data packet predecessors (X.25, frame relay, etc.), ATM uses short, fixed-length, 53-byte packets that are called cells. ATM also uses a very streamlined form of error recovery and flow control relative to its predecessors. In fact, the ATM standard essentially eliminates most error protection and flow control at the link level, leaving these functions to higher level protocols at the edges of the network. This approach permits rapid routing of the short cells with minimal network delay and jitter, making ATM compatible with voice, data and video services. ATM has been embraced by the computer, LAN, and WAN industries, so a seam-less packet communication from the source computer through LANs, WANs, and the public-switched network is a reality.

If this level of connectivity becomes available to the average consumer and if advanced broad band services that combine voice, broad band data and video are similarly available at a reasonable price, then the volume of ATM traffic that may be generated in the future is virtually limitless. As a result, the number and size of the switches and cross-connects required to route this ATM packet traffic may also grow by phenomenal rates within the next decade. ATM switches and cross-connects for toll and gateway applications may require aggregate bandwidths ranging from 155 gigabits per second (1000 inputs at SONET OC-3 155 megabits per second rates) to 2.4 terabits per second (1000 inputs at SONET OC-48 2.4 gigabits per second rates). Additionally, if demand for broad band services to the home and/or LAN/WAN connectivity through the public-switched network grows as some experts believe, then local telephone exchange carriers may require ATM switches and cross-connects for metropolitan area network (MAN) applications having aggregate bandwidths ranging from 100 Gigabits per second (50,000 inputs at Ethernet 10 Megabits per second rates and 20 percent occupancy) to 775 Gigabits per second (50,000 inputs at SONET OC-3 155 Megabits per second rates and 10 percent occupancy).

By necessity, most of the current architectural research and hardware/software development for ATM switches has concentrated on switches with much smaller aggregate bandwidths that will meet the more near-term needs of the marketplace. For example, most of the proposals within the LAN/WAN community have supported aggregate bandwidths ranging from 150 Megabits per second to 12 Gigabits per second, and most of the published proposals within the telecommunications community have supported aggregate bandwidths ranging from 20 Gigabits per second to 160 Gigabits per second. Extensions of most of these architectures to larger sizes usually produce systems that are cost prohibitive, size prohibitive, and/or physically unrealizable because of limits of the underlying to technology.

For example, very common designs for large, high-throughput switches use a multi-stage interconnection network containing multiple stages of switching nodes (node-stages) interconnected by stages of links (link-stages) to provide multiple paths between input ports and output ports. Clos, Banyan and Benes networks are examples of such networks. A multiple stage network design can yield networks with very high levels of performance (low blocking probabilities, low delay, high degrees of fault tolerance, etc.), and may result in low system-level costs, because network resources (nodes and links) are time-shared by the many different paths that can be set up within the network. Physically realizing a multistage network for ATM because of the very short packet duration time is, however, a problem.

The design of any large, high-throughput ATM switching architecture must address two fundamental issues that profoundly effect the overall performance of the resulting ATM switch. The first of these issues is cell loss due to blocking within the internal links of the distribution network (also known as the switching fabric), and the second is cell loss due to contention for output ports by two or more ATM cells that pass through the switch at the same moment in time. The first issue can usually be solved by designing a network with sufficient switching fabric (nodes and links) so that multiple paths exist between input ports and output ports. As a result, if two or more ATM cells attempt to use the same shared resource (nodes or links) within the switching fabric, the cells can usually find two disjoint paths that eliminate the internal network blocking problem. The second issue requires the switch designer to identify a technique for handling simultaneous cells.

A general design technique for a switch to handle cells destined for the same output port is analyzed in an article, A Growable Packet Switch Architecture, IEEE Transactions on Communications, February, 1992, by Eng et al. and in another article The Knockout Switch, ISS AT&T Technical Papers, 1987, by Yeh et al. This general design technique segments the switch into two distinct parts, as shown in FIG. 1. A N×(FN) distribution network (which provides for N input ports) and a bank of K m×n output packet modules (which provide for a total of M=Kn output ports). Given that each of the links emanating from the distribution network is required to be terminated at one of the inputs to an output packet module, it can be seen that the equation FN=Km must be satisfied. The switching fabric is a memory-less N×(FN) fanout switch whose function is to route an arriving ATM cell to any of the m inputs on the output packet module connected to the cell's desired output port. The output packet module is a m×n switch with buffers that are available for storing cells that must be delayed when two or more cells contend for a particular output port. If the arriving traffic is uniformly distributed across all output ports and if the buffers within the output packet modules are sufficiently large, then the ratio m:n can always be chosen large enough to force the cell loss probability within the network to be below any desired cell loss probability level. In fact, if the network size (N) is large and if R represents the switch loading, then the cell loss probability of a network with m×n output packet modules as shown by Eng et al is given by: ##EQU1## Present packet switches have acceptable cell loss probabilities of approximately 10⁻¹², so any loss probability smaller than present units are considered acceptable.

Besides the ATM cell losses because of internal contentions, in an ATM Packet Switch where all of the N cells arrive simultaneously at the inputs of the distribution network, the cells must be processed by each stage of the path hunt processing pipeline before the next group of N cells arrives at the network input ports. For example, if the incoming transmission lines support SONET OC-48 2.5 gigabits per second bit-rates, then the group of N ATM cells that arrive together must be processed and sent on to the next stage of the pipeline every 176 nsec (the duration of an ATM cell on a 2.5 gigabits per second link). For large values of N, a substantial amount of processing power will therefore be required to complete the path hum operations for all N cells. (Note: IF N=256, then 1.45×10⁹ path hunts must be completed every second, which corresponds to an average processing rate of one path hunt every 684 psec). Present commercial microprocessors can process approximately 100 million instructions per second. If each path hunt took only one instruction, at least 15 of microprocessors would spend 100% of their processing time performing these path hunts. Thus, a controller based on something other than a single microprocessor will be necessary for a large ATM packet switch.

Two approaches to solving the path hunt problem can be envisioned. One approach uses in-band, i.e. self-routing, control techniques to perform the path hunts. The Clos, Banyan and Benes networks multistage networks mentioned above typically use in-band controllers and control techniques. For in-band control techniques, the connection requests are prepended to the ATM cells and routed through the switch along the same paths used by the following ATM payload. The in-band control approach typically requires parallel processing elements to be distributed throughout all of the nodes in the network, resulting in relatively complicated hardware to be duplicated in every node of the network in order to perform localized path hunting operations (on only the cells that pass through that node) when determining how to route the arriving connection requests and ATM cells. The second approach uses an out-of-band controller and out-of-band control techniques whereby the controller and switch fabric are logically separated, so connection requests must be routed to the controller, which performs the path hunting, before the resulting control signals are inputted to the switch fabric to set the paths. This second approach requires that the out-of-band controller have tremendous processing power, (as mentioned above), because of the many path hunting operations that must be performed in a very short period of time.

Since the path hunting operations in switches using in-band control techniques are only based on localized traffic information and not on global information regarding all of the switch traffic, the routing that in-band controllers perform may not always optimal with regard to internal blocking. As a result, networks based on in-band control techniques often require more switch fabric (stages and nodes) in order to provide the same operating characteristics as a less expensive switch based on out-of-band control techniques. Thus, there is a need in the art for a packet switch controller that provides a global view of all paths to provide optimal path hunting for each packet.

It is an object of the present invention to provide an out-of-band controller for use in an ATM packet switch which uses global information to optimally hunt paths.

It is another object of the invention to provide an out-of-band controlller for use in a large aggregate throughput ATM packet switch.

It is another object of the invention to provide a distributed, out-of-band controller that controls an ATM packet switch to provide a lower cell loss probability than present packet switches.

SUMMARY OF THE INVENTION

Briefly stated, in accordance with one aspect of the invention, the foregoing objects are achieved by providing a distributed, out-of-band controller for an ATM packet switch having line interfaces with one ATM cell period storage, a single stage, reduced complexity switch fabric, an out-of-band controller, and output packet modules.

In accordance with an other aspect of the invention, the foregoing objects are achieved by providing a controller for a packet switch for locating a path for each telecommunication packet, this controller includes a memory for storing a busy-or-idle status of each connection of the packet switch between its switch fabric and its output modules. This memory is divided into a number of busy-or-idle status tables, and these busy-or-idle tables are accessed concurrently for rapidly locating a path for each telecommunication packet.

In accordance with another aspect of the invention, the foregoing objects are achieved by providing a controller for a packet switch which has a switch fabric, which in turn has a number of pipes with each pipe having a number of crossbar switches. This controller is for locating a path for each telecommunication packet received on the input lines of the packet switch. The controller includes a number of pipe hunting controllers, with each of these pipe hunting controllers controlling a respective pipe out of the number of pipes. Each of these pipe hunting controllers has a plurality of crossbar switch controllers, with each crossbar switch of a pipe having a respective crossbar switch controller associated with it. The controller also includes a store for a storing busy-or-idle status table. Each bit of the busy-or-idle status table in the store is associated with a respective connection of a respective crossbar switch and stores a respective busy-or-idle bit to control the operation of that connection. Furthermore, the controller can access each bit of the busy-or-idle status table to request a path for each telecommunication packet concurrently. Thus, allowing very rapid packet switching operations.

BRIEF DESCRIPTION OF THE DRAWING

FIG. 1 is a block diagram of a generalized growable packet switch;

FIG. 2 is a slightly re-drawn FIG. 1.

FIG. 3 is a block diagram of a growable packet switch in which the switch fabric is partitioned into L multiple pipes according to the present invention.

FIG. 4 is a block diagram, similar to FIG. 3, of a specific embodiment of the present invention having four pipes (L=4) and showing a configuration for the pipes.

FIG. 5 is a simplified block diagram of the embodiment shown in FIG. 4 which shows greater details of the controller.

FIG. 6. illustrates the timing sequences of requests to the controller shown in FIG. 5.

FIG. 7 is a simplified block diagram of an embodiment of an output module.

FIG. 8 is an illustrative example of rolling and its operation in a plan view of an amusement park and its satellite parking lots.

FIG. 9 and FIG. 15 show plots of calculated values of various ATM cell loss probabilities both with and without the assignment of preferences.

FIG. 10 is a simplified block diagram of a representative switch controller and its link controllers.

FIG. 11 and FIG. 16 are a detailed logic diagram of a link controller.

FIG. 12 is a state table for the link controller shown in FIG. 11.

FIGS. 13A-13D when joined together show the operation of a switch controller in response to a sequence of requests.

FIG. 14 illustrates the rolling of path hunting requests through a switch having four pipe controllers according to the present invention.

DETAILED DESCRIPTION

Referring now to FIG. 2, a large, generalized switch 10 for ATM communications, is shown in block diagram form. ATM switch 10 has a number of input interfaces 12₀ -12_(N-1), a switch fabric 14, and buffered output modules 16₀ -16_(V-1). For ATM operation, input interfaces 12₀ -1_(2N-1), are high speed digital amplifiers that serve as a matching networks and power amplifiers for fanning out information received on their inputs to multiple input ports of the switch fabric 14. Each of the input interfaces 12₀ -12_(N-1) also needs a capability to store one ATM cell, as will be explained below. Similarly for ATM operation, buffered output modules 16₀ -16_(V-1) are concentrators that are buffered to reduce packet loss when two or more packets are directed to and contend for the same output of outputs Out₀ -Out_(N-1).

Switch fabric 14 includes a fanout F where each of the outputs from the input interfaces 12₀ -12_(N-1) is fanned out to F inputs within switch fabric 14, such that if ATM switch 10 is an N×N switch then switch fabric 14 will have FN internal inputs and FN outputs to output modules 16₀ -16_(V-1). Output Modules 16₀ -16_(V-1) have a fanin or concentration factor of F in order to convert the FN outputs of the switch fabric 14 to N output module outputs Out₀ -Out_(N-1). Each output module 16₀ -16_(V-1) stores arriving ATM packets in FIFO queues, and then routes the ATM packets at the flout of each of these FIFO queues to their desired outputs Out₀ -Out_(N-1) when the output ports are available.

Switch fabric 14 is a general distribution network which may be a network of switches, specifically crossbar switches, to provide multiple paths from each of its input ports 17₀ -17_(N-1) to each of its output ports 19₀ -19_(FN-1). However, it becomes highly impractical to make an N×N switch out of a single crossbar to operate as the switching component of switch fabric 14 when the size of N exceeds 32. Thus, some other way is needed to realize the general architecture shown in FIG. 2.

Referring now to FIG. 3, an ATM switch 10A that is both practical and possible for N inputs where the size of N is at least 256, is shown. Multiple paths from each input 17₀ -17_(N-1) through the switch fabric 14A are provided to prevent blocking. These multiple paths are partitioned into groups called pipes with each pipe providing exactly one path between each input port 17₀ -17_(N-1) and each output port 19₀ -19_(FN-1) within the network. Thus, switch fabric 14A is made up of multiple pipes 18₀ -18_(L-1). The output modules 16₀ -16_(V-1) are essentially the same as the output modules shown in FIG. 2.

Switch fabric as seen in copending and commonly assigned application entitled TERABIT PER SECOND DISTRIBUTION NETWORK filed on Dec. 20, 1994, U.S. Ser. No. 08/366,707, which is hereby incorporated by reference, is a single stage, memoryless, and non-self routing network. Since the switch fabric 14A is not unconditionally non-blocking as a full N×N crossbar switch would be, a controller 20 is included to hunt for a path through the four pipes for each ATM cell. Since each of the pipes 18₀ -18₃ contains a path that could transport the ATM cell, the real purpose of the controller 20 is to find a path that is not blocked.

For ATM switch 10A, if the number of input lines, N is equal to 256 and if each input line is operated at a standard 2.5 Gigabits per second data rate, its aggregate throughput will be 0.640 terabits per second. Scaling or growing such an ATM switch by a factor of two to 512 input lines and output lines should be straightforward and result in aggregate throughputs of greater than 1 Terabits per second. Scaling to an ATM switch size of 1024×1024 is considered within the present technology, and the architecture of the present invention is believed to be extensible even further as the speed of commercially available components increases and as new, faster technologies are developed.

Referring now to FIG. 4, a specific embodiment of an ATM switch 10A is shown. In this specific embodiment ATM switch 10A has two hundred fifty six input interfaces 12₀ -12₂₅₅ which are connected to two hundred fifty-six ATM input lines In₀ -In₂₅₅. The outputs of the input interfaces are connected to the input ports 17₀ -17_(N-1) of the switch fabric 14A. The switch fabric 14A contains a total of sixty-four 16×16 crossbar switches 15₀ -15₆₃ which are partitioned into four pipes 18₀ -18₃. The fanout F is equal to four which if the number of output ports=FN results in 1024 output ports 19₀ -19₁₀₂₃. The output ports 19₀ -19₁₀₂₃ are respectively connected to the inputs of sixteen 64×16 output packet modules 16₀ -16₁₅. The sixteen 64×16 output packet modules are connected to two hundred fifty six outputs Out₀ -Out₂₅₅. Those skilled in the art will recognize that other combinations of components could have been used, for example thirty two 32×8 output modules could have been used instead of the 64×16 output modules shown in FIG. 4.

ATM switch 10A also has a controller 20 which has the tasks of hunting and finding an available pipe through the switch fabric 14A for each ATM packet. The controller 20 uses the fact that the switch fabric 14A is partitioned into four pipes to break the pipe hunting tasks into four parallel pipe hunting tasks that are each temporally shifted by an acceptable amount. Details of one embodiment of such a controller 20 are shown in FIG. 5.

For the 0.640 Terabits per second, N=256 embodiment mentioned previously and shown in FIGS. 4 and 5, the controller 20 may be contained on approximately eight printed circuit boards. Controller 20 would accept up to 256 sixteen-bit request vectors from up to 256 line input interfaces 12₀ -12₂₅₅ and perform path hunts on each of these request vectors within each 176 nanosecond. ATM cell interval to create the 1024 sixteen-bit connect vectors used to established connections within the switch fabric 14A. This requires that controller 20 operate with a processor clock rate of at least 46 Megabits per second. This moderate clock rate permits the logic within the controller 20 to be implemented with off-the-shelf CMOS EPLD's or similar devices ,thus making the cost of the controller 20 (in large quantities) very reasonable.

The movement of request vectors from the input interfaces 12₀ -12₂₅₅ to the controller 20 and the movement of connect vectors from the controller 20 to the crossbar switches 15₀ -15₆₃ of the switch fabric 14A is a challenging task, because large amounts of control information must be transported every 176 nsec ATM cell interval. For example, in an ATM switch containing 256 input interfaces, 256 16-bit request vectors must be transported to the controller 20 every 176 nsec, leading to an aggregate bandwidth of 23 Gigabits per second between the input interfaces sub-system and the controller 20 sub-system. In addition, 1024 16-bit connect vectors must be transported to the switch fabric 14A every 176 nsec to control the crossbars switches 15₀ -15₆₃. This requires an aggregate bandwidth of 93 Gigabits per second between the controller 20 sub-system and the switch fabric 14A sub-system. This 93 Gigabits per second connect vector information can be compressed into 29 Gigabits per second (given that only one input can be routed to an output during each ATM cell interval) by standard compression techniques. However, since this control information should be delivered with high reliability, all of the control connections or control links between these sub-systems should be dually redundant (not shown in FIG. 4), so there is actually 46 Gigabits per second of data moving between the input interfaces cards and the controller 20 and 58 Gigabits per second of data moving between the controller 20 and the switch fabric 14A. Preferably, high-speed serial links 22 will be used to transmit this control information. For such a case, input interfaces 12₀ -12₂₅₅ would be grouped by fours such that only sixty-four serial links would be required to move request vectors from the input interfaces 12₀ -12₂₅₅ to the controller 20, and 128 serial links would be required to move the resulting connect vectors from the controller 20 to the pipes 18₀ -18₃ (assuming the aforementioned data compression techniques are applied to the connect vectors).

While the use of out-of-band control techniques does require the additional hardware cost of these high-speed serial control links 22, these links 22 cause very little increase the overall system hardware cost. Considering that the 256-input ATM switch 10A of FIGS. 4 and 5 already has 1024 high-speed serial links required to route ATM cells between the input interfaces 12₀ -12₂₅₅, and the switch fabric 14A (when the fanout of four is included) and 1024 more high-speed serial links are used to route ATM cells from the switch fabric outputs 19₀ -19₁₀₂₃ to the output packet modules 16₀ -16₁₅. Thus, the addition of the 192 serial links 22 for routing of the control information increases the total number of high-speed serial links within the system by merely nine percent.

Applying the calculations of Yeh et al. from the article "The Knockout Switch" the ATM cell loss probability of the ATM switch 10A shown in FIGS. 4 and 5 is 4.34×10⁻³, assuming that the connections of the inputs is symmetrical and not independent as set forth in our copending application entitled "TERABIT PER SECOND DISTRIBUTION NETWORK" filed on Dec. 30, 1994, U.S. Ser. No. 08/366,707. This cell loss probability falls short of the acceptable ATM cell loss probability of less than 1×10⁻¹² mentioned previously.

To reduce the ATM cell loss probabilities, controller 20 applies a temporal spreading technique known as rolling, which provides many statistical advantages. Rolling involves and fulfills three fundamental goals that are aimed at providing more evenly distributed traffic loads. These goals are: (1) spatially distribute the traffic evenly across all pipes 18₀ -18₃ so that one pipe will only carry its proportional fraction of the traffic load, (2) spatially distribute the traffic evenly across all of the 16×16 crossbar switches 15₀ -15₆₃ within each pipe 18₀ -18₃ so that each of the crossbar switches is equally loaded, and (3) temporally distribute the traffic that arrives in a given ATM cell period across two ATM cell periods so that the traffic load can be effectively decreased in an occasional ATM cell period when an unusually high volume of traffic exists and is destined for a particular output packet module. This effective lowering of the traffic load is accomplished by delaying some of the ATM cells arriving during a congested ATM cell interval. The cells are delayed until the next consecutive ATM cell interval when the traffic load competing for the popular resources, i.e. connections to popular output packet modules, will most likely be lower, so the delayed cells should have a higher probability of being routed in the next ATM cell interval. Since the switch fabric 14A is memoryless, the ATM cells that must wait for the next ATM cell interval are stored in their respective input interfaces 12₀ -12₂₅₅.

In addition to satisfying these three fundamental goals of packet traffic control to distribute the load, rolling also satisfies two further very important ATM system goals. First, goal (4) is that the ATM switch 10A must guarantee that ATM cell ordering can be simply maintained when an ATM stream is re-constructed at an output packet module 16₀ -16₁₅ even if rolling causes some of the ATM cells within the stream to be delayed differently than others. Secondly, goal (5) is that rolling must also guarantee that the controller 20 will attempt to route every ATM cell through each of the four paths to its desired output packet module, but each of the successive path hunt attempts must occur in a more lightly-loaded 16×16 crossbar switch so that the first attempt occurs in a 16×16 crossbar switch with many previously-routed ATM cells (and very few available paths to output packet modules) while the fourth and final path hunt attempt occurs in an 16×16 crossbar switch that is virtually empty (thereby providing many available paths to output packet modules). The rolling technique is similar to spatial path hunt techniques that pack as many calls as possible in one portion of a spatial network, which by forcing near 100% occupancy in parts of a system results in the remainder of the calls having a very high probability of being successfully routed through the remainder of the system if usage is below 100%. Thus, rolling in its fourth and final path hunt attempt provides a very high probability of an ATM cell successfully being routed. Goal (5), by packing many ATM cells in one portion of the network, superficially seems to conflict with goal (1) that requires the traffic be spatially distributed across the network. However, as will be explained below, temporal spreading provided by the rolling technique permits the network to simultaneously satisfy both goals (1) and (5).

Assuming that each of the 256 input ports 17₀ -17_(N-1) of FIG. 4 has an ATM cell that needs to be routed through the distribution network, and assuming that the switch fabric 14A is composed of four pipes 18₀ -18₃, then the out-of-band controller 20 may be required to perform 256×4=1024 unique path hunts for the ATM cells before the cells can be routed. To distribute the ATM cells evenly across all four pipes, the 256 ATM cells requesting connections, the rolling technique divides the requests into four groups of equal size. The first group will have path hunts performed for its ATM cells in pipe 18₀ first, then in pipe 18₁, then in pipe 18₂, and finally in pipe 18₃. The second group will have path hunts performed for its ATM cells in pipe 18₁ first, then in pipe 18₂, then in pipe 18₃, and finally in pipe 18₀. The third group will have path hunts performed for its ATM cells in pipe 18₂ first, then in pipe 18₃, then in pipe 18₀, and finally in pipe 18₁. The fourth group will have path hunts performed for its ATM cells in pipe 18₃ first, then in pipe 18₀, then in pipe 18₁, and finally in pipe 18₂. This ring-like ordering of the path hunts guarantees that the routed ATM cells are distributed evenly across all four pipes. In addition, if the ATM cells within each of the four equally sized groups are selected such that the ATM cells within a single group can be routed into exactly four of the 16 inputs on any 16×16 crossbar switch, then the routed ATM cells will also be evenly distributed across all of the 16×16 crossbar switches.

Referring now to FIGS. 5 and 6, a timing diagram for a rolling technique according to the present invention is described. To satisfy goals (1), (2), and (5) simultaneously, the out-of-band controller 20 uses the time delay/time distribution described in goal (3), and these ATM cell delays required by goal (3) must be provided during each ATM cell interval. In all cases, when a group of ATM cells is passed around the ring-like structure of controller 20 from pipe 18₃ to pipe 18₀, the controller 20 re-assigns the cells to the next ATM cell interval (period) which requires that the ATM cells be delayed by one cell period. Because of this re-assignment and delay, each cell group encounters a very lightly-loaded set of 16×16 crossbar switches for its fourth and final path hunt. An additional advantage of this rolling technique using re-assignment and delay of ATM cell intervals is that it also allows more than 64 simultaneously arriving ATM cells to be routed through the switch fabric 14A to any single output packet module 16₀ -16₁₅ (even though there are only 64 connections or links from the switch fabric 14A to each output packet module 16₀ -16₁₅). This is occurs with the rolling technique because all of the ATM cells do not need to be routed during the same ATM cell interval. Thus, the rolling technique when used in the out-of-band controller 20 results in extremely low cell loss probabilities both within the switch fabric 14A and the output modules 16₀ -16₁₅, even during a transient cell interval that has an extraordinarily high traffic load.

The one ATM cell period delays incurred by some of the ATM cells as they are routed through the switch fabric 14A would normally lead to the conclusion that there would be difficulties in satisfying goal(4) of maintaining proper cell ordering. However, the ring-like ordering of the path hunts within the out-of-band controller 20 guarantees that delayed cells in a stream of ATM cells will always be routed through lower-numbered pipes than non-delayed cells (where pipe 18₀ is the lowest-numbered pipe and pipe 18₃ is the highest-numbered pipe). This information, coupled with the fact that ATM cells are delayed by at most one cell period, ensures that proper cell ordering will be maintained if the cells are extracted from the switch fabric 14A and loaded into first-in-first-out queues 174₀ -174₆₃ (shown in FIG. 7) of each output module of the output modules 16₀ -16₁₅ in the order of the lowest numbered pipe to the highest numbered pipe: pipe 18₀, pipe 18₁, pipe 18₂, and pipe 18₃.

Referring now to FIG. 7, the output module 16₀ (and the fifteen other output modules 16₁ -16₁₅) may be a 64×16 embodiment of the concentrator described in U.S. Pat. No. 5,412,646, entitled "ASYNCHRONOUS TRANSFER MODE SWITCH ARCHITECTURE", filed May 2, 1995, by Cyr et al. and commonly assigned to the assignee of the present invention, which application is hereby incorporated by reference. The output module 16₀ in FIG. 7 is a specific case of the generalized concentrator shown in FIG. 4 of the above-referenced patent application of Cyr et al. Since the output modules 16₀ -16₁₅ are well described in the above referenced application, in the interest of brevity they will not be further described here.

To provide a better understanding the equation of the rolling technique, a real-life analogy will be described with respect to FIG. 8, which is a plan view of an amusement park system 500. Consider the problem of transporting a large number of people from amusement park parking lots 511, 512, 513, or 514 to the amusement park 520 using trams to shuttle the people between the two points. Tram system 530 is composed of four tram shuttle trains each with a predetermined route, which is analogous to the four pipes of switch fabric 14A. Each tram shuttle train contains sixteen cars (representing the 16×16 crossbar switches within a particular pipe), and each shuttle car is equipped with sixteen seats (representing the output links emanating from a single 16×16 crossbar switch). In this analogy, each customer (representing an ATM cell) arrives in one of four parking lots 511, 512, 513, or 514 surrounding the amusement park 520. As a result, each customer is instantly placed in one of four groups, and since the parking lots 511-514 are the same size, each group contains an equal number of customers on the average. The customers in any single parking lot 511, 512, 513, or 514 must then divide up and stand in one of sixteen lines, where each line is associated with a respective car of the tram shuttle train. The amusement park 520 is sub-divided into sixteen different theme areas (The Past Land, The Future Land, etc.), and each of the sixteen seats of a particular tram car is labeled with the theme area to which that seat's occupant will be given admission. Before arriving in the parking lot, each customer must randomly chose one of the sixteen theme areas (representing the sixteen output packet modules 16₀ -16₁₅) where he or she wishes to spend the day. Customers must then find an available seat associated with their desired theme area on one of the four trams that passes by the loading area 531, 532, 533, or 534 of their parking lot. If a customer has not found an available seat after four trams have passed by, then he or she is not permitted to enter the amusement park during that day (This harsh condition represents the loss of an ATM cell due to blocking in all four pipes of the distribution network, a small but finite possibility).

The first tram that stops at the loading area that the customer can try has already visited three other parking lot loading areas, so the customer's pre-specified seat may be full. However, if the customer does find his or her seat to be vacant on that tram, then the tram will deliver him or her straight to the amusement park 520. If the customer fails to get on the first tram, he or she must wait and try the second tram which has already visited two other parking lot loading areas. If the customer is successful at finding his or her pre-specified seat on the second tram, that tram will deliver the customer to the amusement park 520 after one more parking lot stop. If the customer fails to get on the first tram and the second tram, then he or she must wait and try the third tram which has only visited one other parking lot loading area. If the customer is successful at finding his or her seat on the third tram, that tram will deliver him or her to the amusement park 520 after two additional parking lot stops. If the customer fails to get on any of the first three trams, then the customer must wait and try the fourth and final tram. Fortunately, this tram has not visited any parking lots yet, so the arriving tram is empty, and the customer's seat will be taken only if another customer in his/her parking lot line is also trying for the same seat. The system 530 satisfies goal (5), because each of the successively arriving trams is more lightly-loaded than the previous one. Thus, a controller 20 rolling ATM cells indeed can fulfill goals (1), (2), and (5).

The rolling technique if used by itself improves the ATM cell loss probability of ATM switch 10A from 4.34×10⁻³ to approximately 10⁻¹¹. Using the analysis techniques of the article "A Growable Packet Switch Architecture" the cell loss probabilities for an ATM switch 10A that has independent connections to the inputs of the switch fabric 14 according to Galois field theory and also has an out-of-band controller 20 that incorporates rolling techniques can be analytically modeled and calculated. Each of the 16×16 crossbar switches in pipe 18₀ receives an offered traffic load equal to Ra=R_(L) /4+Rres, where Rres is defined to be the fraction of the 16 inputs to a 16×16 crossbar switch that are blocked in pipe 18₃ and routed to pipe 18₀ for a re-attempt. For a first attempt at solving for the cell loss probability, let us assume that Rres=R_(L) /16. Thus, the cell loss probability of a single 16×16 crossbar switch in pipe 18₀ can be determined using the equation of Eng et al. ##EQU2## where m=1, n=1, and the switch loading is given by Ra=R_(L) /4+R_(L) /16. Using these assignments, the resulting cell loss probability for a fully-loaded (R_(L=) 1.0) pipe 18₀ 16×16 crossbar switch can be calculated to be:

    P(cell loss in pipe 18.sub.0)=1.3×10.sup.-1.

Thus, the fraction of the 16 inputs to a 16×16 crossbar that are passed to the second pipe after the first attempt is given by:

    f1-2=Ra×P(cell loss in pipe 18.sub.0)=(3.13×10.sup.-1)(1.3×10.sup.-1)=4.06×10.sup.-2.

By symmetry, this should have also been the same as the fraction of inputs that are passed from pipe 18₃ to pipe 18₀, so the residue assumption of R_(L) /16=0.062 above was incorrect. By refining this assumption and performing a second attempt, and now assuming that Rres=R_(L) /32. Thus, the cell loss probability of a single 16×16 crossbar switch in pipe 18₀ can be determined again using the equation of Eng et al., where m=1, n=1, and the switch loading is given by Ra=R_(L) /4+R_(L) /32. Using these assignments, the resulting cell loss probability for a fully-loaded (R_(L) =1.0) pipe 18₀ 16×16 crossbar switch is calculated to be:

    P(cell loss in pipe 18.sub.0)=1.2×10.sup.-1.

Thus, the fraction of the 16 inputs to a 16×16 crossbar that are passed to the second pipe after the first attempt is given by:

    f1-2=Ra×P(cell loss in pipe 18.sub.0)=(2.81×10.sup.-1)(1.2×10.sup.-1)=3.37×10.sup.-2.

This calculation result is very close to the assumed value of Rres=R_(L) /32=3.13×10⁻², so the assumption is considered to be satisfactory. The blocked cells are sent to pipe 18₁ for subsequent path hunting, and they encounter a negligible number of ATM cells from previous attempts. Thus, the 16×16 crossbar switch in pipe 18₁ can be modeled for analysis as a growable packet switch, with m=1, n=1, and Ra=f1-2, and the resulting cell loss probability of this model is 1.4×10⁻²¹. The fraction of the 16 inputs to the 16×16 crossbar in pipe 18₁ that are passed to the pipe 18₂ is 4.2×10⁻⁴. Similar arguments can be used to show that the resulting cell loss probability for cells entering pipe 18₂ is 1.9×10⁻⁴, and the resulting fraction of the 16 inputs to a 16×16 crossbar passed to pipe 18₃ is 7.9×10⁻⁸. The resulting ATM cell loss probability in pipe 18₃ is 3.7×10⁻⁸, and the fraction of the 16 inputs to a 16×16 crossbar not routed in pipe 18₃ (and therefore not routed in all four pipe attempts) is 2.9×10⁻¹⁵. Thus, through the use of the rolling techniques within the out-of-band controller 20, the ATM cell loss probability of an ATM switch 10A with independent connections at the inputs of its switch fabric 14A can be decreased from an unacceptable value of 1.47×10⁻⁶ to an acceptable value of 2.9×10⁻¹⁵.

A preference technique may be used in conjunction with the rolling technique described above to decrease the cell loss probability of an ATM switch 10A even further. Referring back to FIG. 8 and the amusement park analogy, some form of arbitration was required at the tram loading areas to determine which of the customers in the line will be given a particular seat on the tram when more than one customer is requesting the same seat. Similarly, the out-of-band controller 20 must provide an arbitration scheme for selecting which of the arriving ATM cells will be assigned a particular link whenever two or more cells request access to the same link. The arbitration scheme used can have an advantageous effect on the ATM cell loss probabilities.

One possible arbitration scheme is a random scheme to determine which of the ATM cells is assigned the link. The random selection scheme is the scheme assumed for the analysis of the rolling technique presented above. However, other arbitration schemes are possible, and one particular arbitration scheme that has advantageous results is called the preference scheme. The preference arbitration scheme assigns a preference weight to each of the ATM cells in a particular grouping. ATM cells with higher preference weights are given precedence over ATM cells with lower preference weights whenever two or more cells request access to the same link. As a result, an effective hierarchy is created within the groupings of ATM cells.

The creation of a hierarchy may superficially seem to produce undesirable characteristics within the switch fabric 14A, because customers with high preference weights will be offered better service than customers with low preference weights. In fact, the one customer with the highest preference weight within each group can never have his or her ATM cell blocked by another customer's ATM cell. Although this may seem unfair, a detailed analysis of the effects of imposing this hierarchy indicates that it actually leads to improved performance, i.e. lower cell loss probabilities, for all customers- even for the customer at the bottom of the hierarchy with the very lowest preference weight.

The results of this analysis are summarized in FIG. 9 and FIG. 15, where the probability of loss of an ATM cell; i.e., the probability of a cell not being assigned to an available path, is shown as a function of the number of path hunts that were attempted in different pipes by the out-of-band controller 20. In this analysis, it was assumed that the group sizes were four--i.e., up to four ATM cells could simultaneously compete for access to the same link. As a result, four different preference weights were assigned to create a hierarchy for the four input ports associated with each group. The preference weight associated with a particular input port is assumed to be a fixed constant that does not vary with time. The resulting plots 901, 902, 903 and 904 in FIG. 9 indicate that the cell loss probability decreases as more path hunts in more pipes are performed, but it also shows that the inputs with the lower preference weights 903, 904 have higher cell loss probabilities than the inputs with higher preference weights 901, 902, as might be expected. Super-imposed on these plots is a similar plot 910 which indicates the probability of not being served when a random selection arbitration scheme is used instead of the hierarchy arbitration scheme. The surprising and unexpected results are that after path hunt attempts in four different pipes, the random selection arbitration scheme produces cell loss probabilities which are higher than the average of the cell loss probabilities for the hierarchy arbitration scheme. In fact, the plot 910 of the random selection arbitration scheme shows an average cell loss probabilities for all of the input ports which are notably higher than the plots 903 and 904 which are the average cell loss probabilities for even the input ports with the lowest preference weights within the hierarchy arbitration scheme. This phenomenon can be explained by the fact that after three sets of path hunts in three different pipes, the distribution of ATM cell requests entering the fourth pipe is very different depending on whether the random or preferences arbitration scheme is used. In the random selection arbitration scheme, there is a small but equal probability that all of the ATM cells are requesting a path. However, in the hierarchy arbitration scheme, most of the ATM cells with higher preference weights will be requesting a path with a probability of practically zero, while the ATM cell with the lowest preference weight will be requesting a path with a sizable probability, because that particular ATM cell may have been denied access to links in all three of its previous path hunt attempts. However, a single request arriving with a high probability at the fourth and last path hunter in the controller will lead to more routed ATM cells than many requests arriving with low probability, because the single request can always be satisfied since contention for an output link will never occur.

As a result, it seems apparent from the plots in FIG. 9 that by assigning preference weights to the input ports and by using a hierarchy arbitration method to resolve link contention and route paths in the out-of-band controller, the worst-case cell loss probability of the switch fabric 14A can be decreased from 2.9×10⁻¹⁵ that was achieved by the introduction of the rolling technique to an even lower value of 2.4×10⁻¹⁶. It is worth noting that input ports that are assigned higher preference weights will encounter even lower cell loss probabilities as indicated in FIG. 9.

Referring back to FIG. 5, in order to provide a physical embodiment of the rolling and preference methods, the ATM switch 10A is segmented in to four basic sub-systems. These four sub-groups consist of the input interfaces 12₀ -12₂₅₅, the output modules 16₀ -16₁₅, the switch fabric 14A, and the out-of-band controller 20.

The input interfaces 12₀ -12₂₅₅ within the network provide the necessary interfaces between the incoming transmission links and the links connected to the switch fabric 14A and the out-of-band controller 20. As a result, the input interfaces 12₀ -12₂₅₅ must provide a termination for the input transmission line. For example, if the input transmission line is a SONET link, then the input interface must provide for clock recovery, link error detection, SONET pointer processing and frame delineation, ATM cell extraction, and an elastic storage function to synchronize the arriving ATM cells to the system clock within the distribution network. The extracted ATM cells are then loaded into a FIFO buffer of the input interface. The input interface must also read ATM cells from the FIFO buffer and extract the ATM header from the cell. The VPI/VCI field of each ATM header is then used as an address into a translation table located on the input interface. The output of the translation table provides a new VPI/VCI field and the address of the output packet module to which the ATM cell is to be routed. The new VPI/VCI field is written into the ATM cell as a replacement for the old VPI/VCI field, while the output module address is routed as a request vector to the out-of-band controller 20 for the controller fabric 14A. Since the amount of processing time required by the out-of-band controller 20 is a fixed value, the input interface simply holds the ATM cell in a buffer until the out-of-band controller 20 has completed its path hunt and has relayed the results into the switch fabric 14A. Once the switch fabric 14A is loaded with the new switch settings to appropriately route the ATM cell, the input interface can inject the ATM cell into the switch fabric 14A and it will be automatically routed through the switch fabric 14A to its desired output module 16₀ -16₁₅. It should be noted that each input interface 12₀ -12₂₅₅ actually is provided with one link to each of the four pipes 18₀ -18₃ of the switch fabric 14A. In addition, the use of rolling (i.e. temporal spreading) within the switch fabric 14A may require a copy of the ATM cell to be injected into each of the four links during any one of two consecutive ATM cell intervals. As a result, the timing within the input interfaces 12₀ -12₂₅₅ must be tightly coupled and synchronized to the timing of the rest of the sub-systems within the ATM switch 10A.

Each of the two hundred fifty six input interfaces 12₀ -12₂₅₅ in FIG. 5 are numbered with an address ranging from 0 to 255, but each input interface is also assigned an alias address given by a letter between A and P. These alias addresses are used to identify which input port the input interfaces will connect to within the switch fabric 14A. The actual set of four crossbar switches to which a particular input interface is connected is determined by the Galois field techniques that were described previously. These techniques guarantee independence between all of the inputs on any 16×16 crossbar switch of any pipe.

Each of the sixteen output modules 16₀ -16₁₅ in FIG. 5 is labeled with addresses ranging from AA to PP, and each output module performs an important function within the ATM switch 10A. Each of the output modules 16₀ -16₁₅ within FIG. 5 provides terminations for a respective set of sixty-four links emanating from the switch fabric 14A. Each output module 16₀ -16₁₅ also provides two basic functions: it provides a small degree of space switching to route each ATM cell arriving on one of the sixty-four inputs to the desired one of the sixteen output ports, and it provides buffering of ATM cells to handle the problems associated with multiple packets that are simultaneously destined for the same output Out₀ -Out₂₅₅.

There are many ways for these two functions to be implemented. The most straight-forward approach would probably construct a shared memory switch that could perform sixty-four memory writes and sixteen memory reads within an ATM cell interval (176 nsec). The memory could then be treated as sixteen disjoint linked lists (one for each output Out₀ -Out₂₅₅) along with a seventeenth linked list containing idle memory locations. Although simple, this approach requires eighty memory accesses every 176 nsec, so it would demand memories with 2.2 nsec access times. An alternate approach would split each 64×16 output module 16₀ -16₁₅ into a 64×16 concentrator and a 16×16 shared memory switch. The concentrator would be a memory system that provides for sixty-four writes and sixteen reads every ATM cell interval, but the memory size could be small (and memory speeds could be fast) since the buffering required for output contention problems is not provided in this memory. In addition, the 64×16 concentrator could be implemented as a single linked list spread out across sixty-four distinct memory chips. As a result, each memory chip would require only one write and up to sixteen reads for every ATM cell interval. The 16×16 shared memory switch only performs thirty-two memory accesses every ATM cell interval, so slower (and larger) memories could be used, and the buffering for output contention problems could be provided in this shared memory portion of the output module. Thus, this latter arrangement is the more practical alternative for an output module.

The switch fabric 14A is essentially a group of small circuit switches that provide the required connectivity between the input interfaces and the output modules in response to the control signals generated by the out-of-band controller 20. In the embodiment of the ATM switch 10A shown in FIG. 5, the switch fabric 14A is composed of sixty-four 16×16 crossbar switches, where disjoint groups of sixteen switches comprise a pipe. The four pipes are labeled pipe 18₀, pipe 18₁, pipe 18₂, and pipe 18₃, and the sixteen 16×16 crossbar switches within a given pipe are labeled switch 0-15. The crossbar switches must be capable of receiving the control signals generated by the out-of-band controller 20 and must re configure all of the switch settings during a guard-band interval between consecutive ATM cells. Each 16×16 crossbar switch supports sixteen inputs labeled input A through input P, and each 16×16 crossbar switch also supports sixteen outputs labeled output AA to output PP. It was noted above that each input interface connects to a different 16×16 crossbar in each of the four pipes 18₀ -18₃, but it should now be noted that an input interface that connects to input X in pipe 18₀ is required to be connected to input X in the other three pipes 18₁ -18₃ as well, where X is an element of the set {A,B, . . . ,P}. The actual connections between the input interfaces 12₀ -12₂₅₅ and the crossbar switches within the switch fabric 14A are determined using Galois field theory techniques that were referenced above. These techniques guarantee independence between input ports for routing within switches in each pipe of the switch fabric 14A. FIG. 5 also illustrates that output YY from each of the sixty-four crossbar switches is routed to one of the sixty-four inputs on the 64×16 output module labeled YY, where YY is an element of the set {AA,BB, . . . ,PP}.

The basic function of the out-of-band controller 20 for the switch fabric 14A is to determine through which of the four pipes 18₀ -18₃ a particular ATM cell may be routed. Once the out-of-band controller 20 has successfully determined a pipe through which the ATM cell is to be routed without being blocked, the task of setting up the path through the pipe is simple, because by the definition of a pipe, there will exist only one path within the pipe between the input port of the arriving ATM cell and the desired output module. As a result, the fundamental path hunting task of a switching network is essentially reduced to the simpler task of pipe hunting in the ATM switch 10A.

The out-of-band controller 20 still requires a large busy-idle table to identify the status of each of the intermediate (FN) links between the 16×16 crossbar switches of the switch fabric 14A and the output modules 16₀ -16₁₅ as busy and unavailable or idle and available. However, this large busy-idle table may be sub-divided into many small busy-idle tables that the controller 20 can access in parallel, and thereby perform many pipe hunting operations in parallel. There are many ways to implement the controller 20 for a large switch having the general growable packet switch architecture. In the extreme case, four levels of parallelism may be applied to the architecture of the controller 20 to perform pipe hunting. One embodiment that uses three levels of parallelism will be described in detail, first and then a fourth level of parallelism for the controller 20 will be discussed.

The first level of parallelism is obtained by providing each of the four pipes 18₀ -18₃ with a respective pipe hunt controller 24₀ -24₃. This level of parallelism allows pipe hunting to be carried out in all four pipe hunt controllers 24₀ -24₃ simultaneously. The second level of parallelism is obtained by providing switch controllers 26₀ -26₆₃, with sixteen switch controllers within each pipe hunt controller 24₀ -24₃. A unique switch controller 26₀ -26₆₃ is respectively associated with each of the 16×16 switches within each pipe of the switch fabric 14A. As a result, pipe hunting operations can be carried out in parallel within all sixteen of the switch controllers of each pipe hunt controller 24₀ -24₃. The third level of parallelism is obtained by permitting each of the switch controllers 26₀ -26₆₃ to perform parallel processing over all sixteen of the output links attached to its respective 16×16 crossbar switch. Effectively, each of the switch controllers 26₀ -26₆₃ reads sixteen busy-idle bits from its busy-idle memory in parallel, performs parallel pipe hunting operations based on those sixteen bits, and then writes the sixteen resulting busy-idle bits into its respective busy-idle memory in parallel with the other busy-idle memories. A representative switch controller 26₀ of the sixty four switch controllers 26₀ -26₆₃ is shown in FIG. 10. The concurrent processing of sixteen busy-idle bits is accomplished by providing switch controller 26₀ sixteen unique link controllers AA-PP, each of the link controllers AA-PP is assigned the task of processing busy-idle bits for one intermediate link between its portion of the switch fabric 14A and its respective output modules. In the embodiment shown in FIG. 10, the large busy-idle memory required to control switch 10A has been divided into many single bit memories, busy-idle flip-flops, with each single bit, busy-idle memory being logically and physically associated with its respective link controller AA-PP.

The general data flow for request vectors generated by the input interfaces 12₀ -12₂₅₅ is shown in FIG. 5. For example, input interface 12₀ in FIG. 5 routes its request vector via connection 21₀ to pipe hunting controller 24₀ where it is poked into the pipe hunting ring (i.e. controller 20), and the rolling scheme requires the request vector to be looped through pipe hunt controller 24₁, pipe hunt controller 24₂, and pipe hunt controller 24₃ as it circulates around the ring. In general, each of the input interfaces 12₀ -12₂₅₅ produces one request vector, and each request vector will contain a number of bits equal to the number of output modules within the system. The request vector from a single input interface in FIG. 5 is thus a sixteen-bit data word, where each bit of the request vector points to one of the sixteen output modules. If an ATM cell within a input interface is requesting a connection to an output port on the i-th output module, then bit i within the request vector will be set to a logic "1" and all other bits within the request vector will be set to a logic "0". When the controller 20 receives this particular request vector from the input interface, it can then identify that a path is required between the source input interface and the i-th output module.

The entire sixteen-bit request vector from a input interface is routed via a respective control connection 21₀ -21₂₅₅ to one of the four pipe hunt controllers 24₀ -24₃, and the controller 20 pokes the vector into one of the sixteen switch controllers associated with that particular pipe hunt controller. As shown in FIG. 10, the sixteen bits of the request vector are injected into a switch controller and are distributed across all sixteen of the link controllers within that particular switch controller. Each link controller as shown in FIGS. 11 and 16 is associated with a single link between the crossbar switches and the output modules, and it essentially processes one bit of the sixteen-bit request vector. This finite state machine circuitry that is associated with a single link controller consists of one flip-flop (the single-bit memory required to store the busy-idle bit associated with this link controller's link) and four logic gates. A state table description of the link controller operation is given in FIG. 12, where the state variable is defined by the busy-idle bit. The link controller hardware provides for one request vector input bit, designated request-in; one request vector output bit, designated request-out; and one connection vector output bit, designated connect. The request vector input bit is a logic "1" if the input desires a connection through the link associated with this link controller-otherwise, it is a logic "0". The request vector output bit is a logic "1" if the logic "1" input request vector bit was not satisfied by this particular link controller-otherwise, it is a logic "0". The connect vector output bit is a logic "1" if the logic "1" input request vector bit was satisfied by this particular link controller indicating the ATM cell will be routed to its desired output module through the link associated with this link controller-otherwise, it is a logic "0". The busy-idle flip-flop in FIG. 10 is reset to the logic "0" (idle) state at the beginning of each ATM cell slot, so the first request vector bit that enters the link controller with a logic "1" request is assigned the link (creating a logic "1" connect vector bit and a logic "0" output request vector bit) and sets the busy-idle flip-flop to the logic "1" (busy) state. Any subsequent request vector bits that enter the link controller during this particular ATM cell slot will be denied a connection through this link (forcing a logic "0" output on the connect vector bit and creating an output request vector bit that is identical to the input request vector bit). A time-lapsed view of several consecutive sixteen-bit request vectors passing through a single switch controller is shown in FIG. 12, along with the resulting states of the busy-idle bits stored within the switch controller. The resulting output request vectors and output connect vectors illustrate the general operation of each of the pipe hunt controllers 24₀ -24₃.

The use of rolling within the controller 20 requires a very precise temporal ordering of two fundamental events: poking and busy-idle flip-flip clearing. The timing diagram of FIG. 14 illustrates the synchronization and data flow that might be used for the logic within the controller 20. As indicated by the timing diagram, the flow of data around the ring of controller 20 is from pipe controller 24₀ to pipe controller 24₁ to pipe controller 24₂ to pipe: controller 24₃ and back to pipe controller 24₀. Request vectors as shown in FIGS. 13A-13D generated by input interfaces with alias addresses A, B, C, and D are poked into pipe controller 24₀. Request vectors generated by input interfaces with alias addresses E, F, G, and H are poked into pipe controller 24₁. Request vectors generated by input interfaces with alias addresses I, J, K, and L are poked into pipe controller 24₂. Request vectors generated by input interfaces with alias addresses M, N, O, and P are poked into pipe controller 24₃. The poking times and busy-idle bit clearing times take place at different moments within each of the pipe hunt controllers 24₀ -24₃. From the point of view of any pipe controller, the request vector bits flow through the pipe controller in alphabetical order (A to P) if one ignores the busy-idle bit clearing times. This ordering guarantees that the aforementioned advantages of preferences will be realized within the controller 20, because the request vector generated from a input interface with alias address A will always be given precedence over the request vectors generated from input interfaces with alias addresses B, C, and D, etc.

The benefits derived from forced independence between the inputs on a particular 16×16 crossbar switch produce a slight increase in the complexity of the pipe hunter circuitry. Because of the independent connections between the input interfaces and the switch fabric 14A, which independence is assured by the use of Galois field theory, a request vector from a single input interface must be appropriately routed to several different switch controllers in each of the stages in the pipe hunting ring. The mixing nature of the Galois field theory generated connections requires each input interface 12₀ -12₂₅₅ to be connected to a different set of 16×16 crossbar switches within the switch fabric 14A, and as a consequence, it also requires request vectors generated on different input interfaces to be routed through entirely different sets of switch controllers within the controller 20. Since request vectors are time-multiplexed on links within the controller 20, all of the request vectors (within a particular ATM cell slot) that are expelled from a particular switch controller in one pipe hunter stage must (by definition) be routed to different switch controllers in the next pipe hunter stage. To provide this dynamic routing of the request vectors, each pipe hunt controller 24₀, 24₁, 24₂ and 24₃ is connected to a respective small switching network 30₀, 30₁, 30₂ and 30₃, shown in FIG. 5. Alternatively, simple multiplexers may be used instead of switching networks 30₀, 30₁, 30₂ and 30₃, thereby greatly decreasing costs for the controller 20. Fortunately, the required configurations of these small switching networks 30₀, 30₁, 30₂ and 30₃,(or multiplexers) are cyclic with a period equal to the ATM cell period, and the required configurations can be determined a priori and can therefore be "hard-coded" into the small switching networks (multiplexers) during the design of the circuitry of the controller 20.

As mentioned previously, ATM switch 10A shown in FIG. 5 might be scaled such that the number of input lines were 512, 1024 or even higher. For those size switches, assuming that the input lines are carrying 2.5 Gigabits per second data rates, the aggregate throughput would be over 1.0 Terabits per second. For switches of that size, a fourth level of parallelism may be needed to provide sufficient processing power for the controller 20 to hunt for all those paths through all those pipes. For ATM switches with 512 and 1024 input lines, the data rates on wires within their respective controllers are 204 Megabits per second and 386 Megabits per second, which is considerably higher that the 113 Megabits per second rate of the 256 input line version of ATM switch 10A.

The basic idea behind the fourth level of parallelism is a modification of the previously described controller 20 design which requires that request vectors be routed through the pipe hunter stages in parallel. In particular, all of the request vectors that are poked into a particular pipe are routed through the pipe hunter stages together, and these request vectors are said to comprise a poke group. In the embodiment shown in FIG. 5, this approach to the design of controller 20 creates four poke groups of sixteen-bit request vectors, so each poke group contains sixty-four bits. The four poke groups can be labeled with a concatenation of the four alias labels on the request vectors. As a result, the four poke groups for the re-designed pipe hunter of FIG. 5 are called ABCD, EFGH, IJKL, and MNOP. It is important to note that whenever a single sixty-four bit ABCD poke group is being routed through one of the switch controllers in pipe controller a of FIG. 5, there is also a sixty-four bit ABCD poke group being routed through each of the other fifteen switch controllers in pipe controller 24₀. As a result, there are a total of 1024 request vector bits associated with sixteen ABCD poke groups that are being routed through pipe 18₀ at a single instant of time. The modified controller 20 processes the request vectors for all N input ports (by passing them through all four pipe hunt controllers 24₀ -24₃) every eight clock cycles, and since this task must be completed within a single 176 nsec ATM cell interval, the required clock rate within the controller 20 is 46 Megabits per second regardless of the size (aggregate throughput) of the N×N ATM switch. As a result, since the controller 20 must perform eight processing steps (regardless of the network size), the process is said to be an O(1) path hunt algorithm. During the execution of this O(1) path hunt algorithm for the N=256 input ATM switch 10A of FIG. 5, the equivalent of 16,384 link controller path hunts and 16,384 link controller path hunt checks are performed every 176 nsec, so if each path hunt is considered to be an instruction execution and each path hunt check is considered to be an instruction execution, then the controller 20 can be viewed as a parallel processor capable of sustaining a 186 giga instructions per second processing rate. The trade-off for maintaining a reasonable data rate in the controller 20 (regardless of size) is an increase in link controller logic complexity and an increase in signal connections passing between successive stages of the controller as the size is increases. ATM switch designs with aggregate throughputs in excess of 1 Terabits per second will require between 4096 and 32,768 signals (at 46 Megabits per second) to be routed between successive pipe controller stages.

In addition to increasing the number of signals between pipe controller stages, the use of parallelism within the controller 20 also requires a slight increase in the hardware requirements for each link controller, because each link controller must now support a parallel path hunt on four bits within the poke group. The extra hardware added to the controller 20 by the fourth level of parallelism should be offset by the resulting lower processing rate.

Simulations have shown the switch 10A to have very low cell loss probabilities. For a fully loaded switch as shown in FIG. 5, the average cell loss probability is much better than 1×10⁻¹², and this cell loss probability decreases rapidly as the input line occupancy is decreased from 100 percent. Also, the switch fabric 14A is not very sensitive to bursty traffic loads. Simulations thus far indicate that an electronic embodiment is the most cost effective, however, an embodiment using free-space digital optics is contemplated and considered to be within the scope of the present invention. Free space optics version of the controller may have packaging advantages for routing the many signals between the pipe controllers within the overall controller. Whether electronics or photonics/electronics components are used, either may capitalize on the parallel processing architecture described above.

The switch fabric 14A is essentially technology-independent. An embodiment using free-space digital optics as the interconnection technology within the switch fabric is contemplated. The 16×16 crossbar switches within the switch fabric 14A will be implemented with FET-SEED device arrays. Such an approach may provide many benefits within the switch fabric 14A, because the resulting design based on optical interconnections may have lower levels of signal crosstalk, lower chip counts (and potentially lower cost) due to increased device integration, lower signal skew, and lower overall power dissipation (resulting in simpler thermal management techniques within the switch fabric 14A).

While the invention has been particularly illustrated and described with reference to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form, details, and applications may be made therein. For example, more than four pipes may be used in the switch fabric requiring modifications to the controller. It is accordingly intended that the appended claims shall cover all such changes in form, details and applications which do not depart from the true spirit and scope of the invention. 

What is claimed is:
 1. A controller for a packet switch having a switch fabric having a plurality of pipes with each pipe having a plurality of crossbar switches for locating a path for each telecommunication packet, comprising:a plurality of pipe hunting controllers, with each of said pipe hunting controllers controlling a respective pipe of said plurality of pipes; each of said pipe hunting controllers having a plurality of crossbar switch controllers, with each crossbar switch of a pipe having a respective crossbar switch controller; a plurality of storage means for storing busy-or-idle status tables; each of said plurality of storage means is associated with a respective crossbar switch controller of said plurality of crossbar switch controllers and stores a respective busy-or-idle status table therefor; and means for accessing each of said busy-or-idle status tables concurrently.
 2. The controller for a packet switch as set forth in claim 1, wherein each of said busy-or-idle tables has a plurality of busy-or-idle status bits with each busy-or-idle status bit corresponding to a busy-or-idle status of a respective output of its respective crossbar switch.
 3. The controller for a packet switch as set forth in claim 2, wherein each of said crossbar switch controllers processes its plurality of busy-or-idle status bits concurrently.
 4. The controller for a packet switch as set forth in claim 2, wherein each busy-or-idle status bit is stored in a respective output controller corresponding to the respective output of its respective crossbar switch.
 5. The controller for a packet switch as set forth in claim 4, wherein each output controller processes one busy-or-idle bit for controlling its respective output for each packet processing time.
 6. A controller for a packet switch having a switch fabric having a plurality of pipes with each pipe having a plurality of crossbar switches for locating a path for each telecommunication packet, comprising:a plurality of pipe hunting controllers, with each of said pipe hunting controllers controlling a respective pipe of said plurality of pipes; each of said pipe hunting controllers having a plurality of crossbar switch controllers, with each crossbar switch of a pipe being controlled by its respective crossbar switch controller; a plurality of storage means for storing busy-or-idle status tables; each of said plurality of storage means is associated with a respective crossbar switch controller of said plurality of crossbar switch controllers and stores a respective busy-or-idle status table therefor; and means for accessing each of said busy-or-idle status tables concurrently; wherein each of said storage means comprises: means for storing a busy-or-idle bit; means for reading said busy-or-idle bit from said storage means; means for logically operating on said busy-or-idle bit with a request bit to produce a resulting busy-or-idle bit that is stored in said storage means, a request-out bit and a connect bit; and said connect bit causes a path to be connected through its respective crossbar switch if said connect bit is set.
 7. The controller for a packet switch as set forth in claim 6, further comprising:means for forwarding said request-out bit to another of said plurality of storage means in another pipe to hunt a path where said request-out bit is inputed to a respective logical operating means of said another storage means and logically operated on with another busy-or-idle bit to produce a resulting busy-or-idle bit, another request-out bit and another connect bit.
 8. The controller for a packet switch as set forth in claim 6, wherein sixteen request bits are transmitted as a request vector to sixteen storage means in parallel.
 9. A method for controlling a packet switch having a switch fabric having a plurality of pipes with each pipe having a plurality of crossbar switches, and a plurality of output modules during each packet cycle period, comprising the steps of:setting all busy-or-idle bits to idle at a beginning of each packet cycle period; reading sixteen busy-or-idle bits from a busy-or-idle memory of a crossbar switch controller in parallel as a busy-or-idle vector; performing parallel pipe hunting operations by logically combining said busy-or-idle vector and a first input request vector to produce a first updated busy-or-idle vector, a connect vector and an output request vector; storing said updated busy-or-idle vector into the busy-or-idle memory in parallel; and forwarding said connect vector to a first crossbar switch of said plurality of crossbar switches to set a path from an input of said switch fabric to an output of said switch fabric for a packet.
 10. The method of claim 9, further comprising the step of:forwarding said output request vector which contains any unfulfilled requests from said input request vector to a second crossbar switch controller in another pipe; using said output request vector as a second input request vector for a second crossbar switch of said plurality of crossbar switches connected to and controlled by said second crossbar switch controller; reading sixteen busy-or-idle bits from a busy-or-idle memory of said second crossbar switch controller in parallel; performing parallel pipe hunting operations logically combining said busy-or-idle vector and said input request vector producing a second updated busy-or-idle vector, a second connect vector and a second output request vector; storing said second updated busy-or-idle vector into the busy-or-idle memory of said second crossbar switch in parallel; and forwarding said second connect vector to said second crossbar switch to set a path from an input of said switch fabric to an output of said switch fabric for a packet.
 11. The method of claim 9, wherein said performing parallel pipe hunting operations step includes the step of concurrently processing sixteen busy-idle bits by providing sixteen link controllers within each switch controller with each link controller processing busy-idle bits for a respective intermediate link between the switch fabric and an output module of said plurality of output modules.
 12. A method for controlling a packet switch having a switch fabric having a plurality of pipes with each pipe having a plurality of N×N crossbar switches, and a plurality of output modules during each packet cycle period, comprising the steps of:setting all busy-or-idle bits to idle at a beginning of each packet cycle period; reading N busy-or-idle bits from a busy-or-idle memory of a crossbar switch controller in parallel as a busy-or-idle vector; performing parallel pipe hunting operations by logically combining said busy-or-idle vector and a first input request vector to produce a first updated busy-or-idle vector, a connect vector and an output request vector; storing said updated busy-or-idle vector into the busy-or-idle memory in parallel; and forwarding said connect vector to a first crossbar switch of said plurality of crossbar switches to set a path from an input of said switch fabric to an output of said switch fabric for a packet.
 13. The method of claim 12, further comprising the step of:forwarding said output request vector which contains any unfulfilled requests from said input request vector to a second crossbar switch controller in another pipe; using said output request vector as a second input request vector for a second crossbar switch of said plurality of crossbar switches connected to and controlled by said second crossbar switch controller; reading N busy-or-idle bits from a busy-or-idle memory of said second crossbar switch controller in parallel; performing parallel pipe hunting operations logically combining said busy-or-idle vector and said input request vector producing a second updated busy-or-idle vector, a second connect vector and a second output request vector; storing said second updated busy-or-idle vector into the busy-or-idle memory of said second crossbar switch in parallel; and forwarding said second connect vector to said second crossbar switch to set a path from an input of said switch fabric to an output of said switch fabric for a packet.
 14. The method of claim 12, wherein said performing parallel pipe hunting operations step includes the step of concurrently processing N busy-idle bits by providing N link controllers within each switch controller with each link controller processing busy-idle bits for a respective intermediate link between the switch fabric and an output module of said plurality of output modules. 